Towards non-symmetric conic optimization
نویسنده
چکیده
In this paper we propose a new interior-point method, which is based on an extension of the ideas of self-scaled optimization to the general cases. We suggest using the primal correction process to find a scaling point. This point is used to compute a strictly feasible primal-dual pair by simple projection. Then, we define an affine-scaling direction and perform a prediction step. This is the only moment when the dual barrier is used. Thus, we need only to compute its value, which can even be done approximately. In the second part of the paper we develop a 4n-self-concordant barrier for n-dimensional p-cone, which can be used for numerical testing of the proposed technique.
منابع مشابه
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
The primal-dual Dikin-type affine scaling method was originally proposed for linear optimization and then extended to semidefinite optimization. Here, the method is generalized to symmetric conic optimization using the notion of Euclidean Jordan algebras. The method starts with an interior feasible but not necessarily centered primal-dual solution, and it features both centering and reducing th...
متن کاملPolynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [9]. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [8], which establi...
متن کاملExact duality for optimization over symmetric cones
We present a strong duality theory for optimization problems over symmetric cones without assuming any constraint qualification. We show important complexity implications of the result to semidefinite and second order conic optimization. The result is an application of Borwein and Wolkowicz’s facial reduction procedure to express the minimal cone. We use Pataki’s simplified analysis and provide...
متن کاملAn Interior-Point Trust-Region Algorithm for General Symmetric Cone Programming
An interior-point trust-region algorithm is proposed for minimization of general (perhaps, non-convex) quadratic objective function over the domain obtained as the intersection of a symmetric cone with an affine subspace. The algorithm uses a trust-region model to ensure descent on a suitable merit function. Convergence to first-order and second-order optimality conditions is proved. Numerical ...
متن کاملA Polynomial-time Affine-scaling Method for Semidefinite and Hyperbolic Programming
We develop a natural variant of Dikin’s affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous polynomial-time affine-scaling algorithms have been for conic optimization problems in which the underlying cone is symmetric. Hyperbolicity cones, however, need not be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Optimization Methods and Software
دوره 27 شماره
صفحات -
تاریخ انتشار 2012